Discriminating codes in (bipartite) planar graphs
نویسندگان
چکیده
منابع مشابه
Discriminating codes in bipartite graphs
We study some combinatorial and algorithmic properties of discriminating codes in bipartite graphs. In particular, we provide bounds on minimum discriminating codes and give constructions. We also show that upperbounding the size of a discriminating code is NP-complete.
متن کاملDiscriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity
Consider an undirected bipartite graph G = (V = I ∪A,E), with no edge inside I nor A. For any vertex v ∈ V , let N(v) be the set of neighbours of v. A code C ⊆ A is said to be discriminating if all the sets N(i) ∩ C, i ∈ I, are nonempty and distinct. We study some properties of discriminating codes. In particular, we give bounds on the minimum size of these codes, investigate graphs where minim...
متن کاملStar coloring bipartite planar graphs
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least 8 colors to star color.
متن کاملAuthentication codes and bipartite graphs
In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication code...
متن کاملCodes on Planar Graphs
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several intriguing problems in the intersection of coding theory and graph theory. In this paper, we study codes defined by planar Tanner graphs. We derive an upper bound on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.05.006